Multiple Matching and Runs by the Symbolic Method
نویسندگان
چکیده
منابع مشابه
Symbolic image matching by simulated annealing
In this paper we suggest an optimization approach to visual matching. We assume that the information available in an image may be conveniently represented symbolically in a relational graph. We concentrate on the problem of matching two such graphs. First we derive a cost function associated with graph matching and more precisely associated with relational subgraph isomorphism and with maximum ...
متن کاملObject Recognition by Matching Symbolic Edge Graphs
We present an object recognition system based on symbolic graphs with object corners as vertices and outlines as edges. Corners are determined in a robust way by a multiscale combination of an operator modeling cortical end-stopped cells. Graphs are constructed by line-following between corners. Model matching is then done by nding subgraph isomorphisms in the image graph. The complexity is red...
متن کاملA Block-Grouping Method for Image Denoising by Block Matching and 3-D Transform Filtering
Image denoising by block matching and threedimensionaltransform filtering (BM3D) is a two steps state-ofthe-art algorithm that uses the redundancy of similar blocks innoisy image for removing noise. Similar blocks which can havesome overlap are found by a block matching method and groupedto make 3-D blocks for 3-D transform filtering. In this paper wepropose a new block grouping algorithm in th...
متن کاملExtraction And Matching Of Symbolic Contour Graphs
We describe an object recognition system based on symbolic contour graphs. The image to be analyzed is transformed into a grapha with object corners as vertices and connecting contours as edges. Image corners are determined using a robust multiscale corner detector. Edges are constructed by line-following between corners based on evidence from the multiscale Gabor wavelet transform. Model match...
متن کاملPercentile Finding Algorithm for Multiple Sorted Runs
External sorting is frequently used b>relational database s!-stems for building indexes on tables, ordered retrieval, duplicate elimination, joins, subqueries. grouping, and aggregation; it would be quite beneficial to parallelize this function. Previous parallel external sorting algorithms found in the database literature used a sequential merge as the final stage of the parallel sort. This re...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: The Annals of Mathematical Statistics
سال: 1945
ISSN: 0003-4851
DOI: 10.1214/aoms/1177731090